Optimality and the Linear Substitution Calculus
نویسندگان
چکیده
We lift the theory of optimal reduction to a decomposition of the lambda calculus known as the Linear Substitution Calculus (LSC). LSC decomposes β-reduction into finer steps that manipulate substitutions in two distinctive ways: it uses context rules that allow substitutions to act “at a distance” and rewrites modulo a set of equations that allow substitutions to “float” in a term. We propose a notion of redex family obtained by adapting Lévy labels to support these two distinctive features. This is followed by a proof of the finite family developments theorem (FFD). We then apply FFD to prove an optimal reduction theorem for LSC. We also apply FFD to deduce additional novel properties of LSC, namely an algorithm for standardisation by selection and normalisation of a linear call-by-need reduction strategy. All results are proved in the axiomatic setting of Glauert and Khashidashvili’s Deterministic Residual Structures. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Optimality Theoretic Account of Acquisition of Consonant Clusters of English Syllables by Persian EFL Learners*
This study accounts for the acquisition of the consonant clusters of English syllable structures both in onset and coda positions by Persian EFL learners. Persian syllable structure is "CV(CC)", composed of one consonant at the initial position and two optional consonants at the final position; whereas English syllable structure is "(CCC)V(CCCC)". Therefore, Persian EFL learners need to resolve...
متن کاملCertain subclass of $p$-valent meromorphic Bazilevi'{c} functions defined by fractional $q$-calculus operators
The aim of the present paper is to introduce and investigate a new subclass of Bazilevi'{c} functions in the punctured unit disk $mathcal{U}^*$ which have been described through using of the well-known fractional $q$-calculus operators, Hadamard product and a linear operator. In addition, we obtain some sufficient conditions for the func...
متن کاملAllais-anonymity as an alternative to the discounted-sum criterion in the calculus of optimal growth I: Consensual optimality
The objective of this work is to try to define and calculate the optimal growth path, in the presence of exogenous technical change, without resorting to the discounted-sum criterion. The solution suggested is to consider an optimality criterion expressing an Allais-anonymous intergenerational consensus. The partial characterization of consensual optimality was made possible thanks to the decom...
متن کاملTowards Conflict-Driven Learning for Virtual Substitution
We consider SMT-solving for linear real arithmetic. Inspired by related work for the Fourier–Motzkin method, we combine virtual substitution with learning strategies. For the first time, we present virtual substitution—including our learning strategies—as a formal calculus. We prove soundness and completeness for that calculus. Some standard linear programming benchmarks computed with an experi...
متن کامل